The extended permutohedron on a transitive binary relation
نویسندگان
چکیده
منابع مشابه
The extended permutohedron on a transitive binary relation
For a given transitive binary relation e on a set E, the transitive closures of open (i.e., co-transitive in e) sets, called the regular closed subsets, form an ortholattice Reg(e), the extended permutohedron on e. This construction, which contains the poset Clop(e) of all clopen sets, is a common generalization of known notions such as the generalized permutohedron on a partially ordered set o...
متن کاملProperties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16
Properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16 Abstract. Some properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16 are presented for reference purposes. The attached files contain some tab-delimited properties of perfect binary codes of length 15 and extended per...
متن کاملMaximal and Maximum Transitive Relation Contained in a Given Binary Relation
We study the problem of finding a maximal transitive relation contained in a given binary relation. Given a binary relation of size m defined on a set of size n, we present a polynomial time algorithm that finds a maximal transitive sub-relation in time O(n + nm). We also study the problem of finding a maximum transitive relation contained in a binary relation. For the class of triangle-free re...
متن کاملON FINITE GROUPS IN WHICH SS-SEMIPERMUTABILITY IS A TRANSITIVE RELATION
Let H be a subgroup of a finite group G. We say that H is SS-semipermutable in Gif H has a supplement K in G such that H permutes with every Sylow subgroup X of Kwith (jXj; jHj) = 1. In this paper, the Structure of SS-semipermutable subgroups, and finitegroups in which SS-semipermutability is a transitive relation are described. It is shown thata finite solvable group G is a PST-group if and on...
متن کاملExtended transitive separation logic
Separation logic (SL) is an extension of Hoare logic by operators and formulas for reasoning more flexibly about heap portions or linked object/record structures. In the present paper we give an algebraic extension of SL at the data structure level. At the same time we step beyond standard SL by studying not only domain disjointness of heap portions but also disjointness along transitive links....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2014
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2014.06.004